PERFECT RECALL AND PRUNING IN GAMES WITH IMPERFECT INFORMATION
نویسندگان
چکیده
منابع مشابه
Perfect Recall and Pruning in Games with Imperfect Information
Games with imperfect information are an interesting and important class of games. They include most card games (e.g., bridge and poker) as well as many economic and political models. Here we investigate algorithms for finding the simplest form of a solution (a pure-strategy equilibrium point) to imperfect information games expressed in their extensive (game tree) form. We introduce to the artif...
متن کاملPerfect Recall and Pruning in Games withImperfect
Games with imperfect information are an interesting and important class of games. They include most card games (e.g., bridge and poker), as well as many economic and political models. Here, we investigate algorithms for solving imperfect information games expressed in their extensive (game-tree) form. In particular, we consider algorithms for the simplest form of solution | a pure-strategy equi...
متن کاملSequential Equilibrium and Perfect Equilibrium in Games of Imperfect Recall
Definitions of sequential equilibrium and perfect equilibrium are given in games of imperfect recall.
متن کاملDecidability Results for ATL* with Imperfect Information and Perfect Recall
Alternating-time Temporal Logic (ATL∗) is a central logic for multiagent systems. Its extension to the imperfect information setting (ATLi ) is well known to have an undecidable model-checking problem when agents have perfect recall. Studies have thus mostly focused either on agents without memory, or on alternative semantics to retrieve decidability. In this work we establish new decidability ...
متن کاملA Pruning Algorithm for Imperfect Information Games
IMP-minimax is the analog to minimax for games with imperfect information, like card games such as bridge or poker. It computes an optimal strategy for the game if the game has a single player and a certain natural property called perfect recall. IMP-minimax is described fully in a companion paper in this proceedings. Here we introduce an algorithm IMP-alpha-beta that is to IMP-minimax as alpha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Intelligence
سال: 1996
ISSN: 0824-7935,1467-8640
DOI: 10.1111/j.1467-8640.1996.tb00256.x